Unrestricted and complete Breadth-First Search of trapezoid graphs in time
نویسندگان
چکیده
منابع مشابه
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first able to produce any BFS-tree, and not only one specific to the model given as input, within this complexity. Moreover, it produces all the shortest paths from the root of the BFS-tree to the other vertices of the graph.
متن کاملLexicographic Breadth First Search for Chordal Graphs
Applied to a chordal graph, lexicographic breadth rst search computes a perfect elimination scheme. We present a short elegant proof for this fact using only a new property of separators in chordal graphs.
متن کاملBreadth First Search on Massive Graphs
We consider the problem of Breadth First Search (BFS) traversal on massive sparse undirected graphs. Despite the existence of simple linear time algorithms in the RAM model, it was considered non-viable for massive graphs because of the I/O cost it incurs. Munagala and Ranade [29] and later Mehlhorn and Meyer [27] gave efficient algorithms (refered to as MR BFS and MM BFS, respectively) for com...
متن کاملBreadth-First Heuristic Search
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show that memory requirements can be reduced even further by using a breadth-first instead of a best-first search strategy. We describe optimal and approximate breadth-first heuristic search algorithms that use divide-and-c...
متن کاملDistributed-Memory Breadth-First Search on Massive Graphs
In this chapter, we study the problem of traversing large graphs. A traversal, a systematic method of exploring all the vertices and edges in a graph, can be done in many different orders. A traversal in “breadth-first” order, a breadth-first search (BFS), is important because it serves as a building block for many graph algorithms. Parallel graph algorithms increasingly rely on BFS for explori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2010
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2010.03.015